Strong Explanations in Abstract Argumentation

نویسندگان

چکیده

Abstract argumentation constitutes both a major research strand and key approach that provides the core reasoning engine for multitude of formalisms in computational AI. Reasoning abstract is carried out by viewing arguments their relationships as entities, with frameworks (AFs) being most commonly used formalism. Argumentation semantics then drive specifying formal criteria on which sets arguments, called extensions, can be deemed jointly acceptable. Such extensions provide basic way explaining argumentative acceptance. Inspired recent research, we present more general class explanations: this paper propose study so-called strong explanations acceptance AFs. A explanation set such target acceptable each subframework containing set. We formally show form larger than particular giving possibility having smaller explanations. Moreover, assuming properties, any strategy, broadly construed, explanation. increase variety comes trade-off: an in-depth analysis associated complexity, showing jump polynomial hierarchy compared to extensions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Computing Explanations in Abstract Argumentation

Argumentation can be viewed as a process of generating explanations. We propose a new argumentation semantics, related admissibility, for closely capturing explanations in Abstract Argumentation, and distinguish between compact and verbose explanations. We show that dispute forests, composed of dispute trees, can be used to correctly compute these explanations.

متن کامل

On Computing Explanations in Argumentation

Argumentation can be viewed as a process of generating explanations. However, existing argumentation semantics are developed for identifying acceptable arguments within a set, rather than giving concrete justifications for them. In this work, we propose a new argumentation semantics, related admissibility, designed for giving explanations to arguments in both Abstract Argumentation and Assumpti...

متن کامل

Dialectical Explanations in Defeasible Argumentation

This work addresses the problem of providing explanation capabilities to an argumentation system. Explanation in defeasible argumentation is an important, and yet undeveloped field in the area. Therefore, we move in this direction by defining a concrete argument system with explanation facilities. We consider the structures that provide information on the warrant status of a literal. Our focus ...

متن کامل

Conflicts in Abstract Argumentation

In abstract argumentation traditionally directed attacks might also be called conflicts if the direction of the attack is not of importance. Recent publications emphasize that argumentation graphs when combined with some semantics feature semantic conflicts that might not coincide with syntactic conflicts defined by attacks. We elaborate on characteristics of various semantics and investigate p...

متن کامل

Support in Abstract Argumentation

In this paper, we consider two drawbacks of Cayrol and LagasqueSchiex’s meta-argumentation theory to model bipolar argumentation frameworks. We consider first the “lost of admissibility” in Dung’s sense and second, the definition of notions of attack in the context of a support relation. We show how to prevent these drawbacks by introducing support meta-arguments. Like the model of Cayrol and L...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2021

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v35i7.16805